RESOLUTION METHOD FOR MIXED INTEGER LINEAR MULTIPLICATIVE-LINEAR BILEVEL PROBLEMS BASED ON DECOMPOSITION TECHNIQUE
Authors
Abstract:
In this paper, we propose an algorithm base on decomposition technique for solvingthe mixed integer linear multiplicative-linear bilevel problems. In actuality, this al-gorithm is an application of the algorithm given by G. K. Saharidis et al for casethat the rst level objective function is linear multiplicative. We use properties ofquasi-concave of bilevel programming problems and decompose the initial probleminto two subproblems to names RMP and SP. The lower and upper bound providedfrom the RMP and SP are updated in each iteration. The algorithm converges whenthe dierence between the upper and lower bound is less than an arbitrary tolerance.Finally, we give some numerical examples are presented in order to show the eciencyof algorithm.
similar resources
Resolution Method for Mixed Integer Linear Multiplicative-Linear Bilevel Problems Based on Decomposition Technique
I In this paper, we propose an algorithm base on decomposition technique for solving the mixed integer linear multiplicative-linear bilevel problems. In fact, this algorithm is an application of the algorithm given by G. K. Saharidis et al for the case in which the first level objective function is linear multiplicative. We use properties of quasi-concave of bilevel programming problems and dec...
full textResolution method for mixed integer bi-level linear problems based on decomposition technique
In this article, we propose a new algorithm for the resolution of mixed integer bi-level linear problem (MIBLP). The algorithm is based on the decomposition of the initial problem into the restricted master problem (RMP) and a series of problems named slave problems (SP). The proposed approach is based on Benders decomposition method where in each iteration a set of variables are fixed which ar...
full textSolving Integer and Mixed Integer Linear Problems with ABS Method
Solving mixed integer linear programming (MILP) problems is a difficult task due to the parallel use of both integer and non-integer values. One of the most widely used solution is to solve the problem in the real space and they apply additional iteration steps (so-called cutting-plane algorithms or Gomory’s cuts) to narrow down the solution to the optimal integer solution. The ABS class of alg...
full textA Procedure for Solving Integer Bilevel Linear Programming Problems
This paper is an extension of the K th-best approach [4] for solving bilevel linear programming problems with integer variables. NAZ cut [2] and A-T cut [3] are added to reach the integer optimum. An example is given to show the efficiency of the proposed algorithm.
full textA new method for solving fully fuzzy linear Bilevel programming problems
In this paper, a new method is proposed to find the fuzzy optimal solution of fully fuzzy linear Bilevel programming (FFLBLP) problems by representing all the parameters as triangular fuzzy numbers. In the proposed method, the given FFLBLP problem is decomposed into three crisp linear programming (CLP) problems with bounded variables constraints, the three CLP problems are solved separately...
full textInformation-based branching schemes for binary linear mixed integer problems
Branching variable selection can greatly affect the effectiveness and efficiency of a branchand-bound algorithm. Traditional approaches to branching variable selection rely on estimating the effect of the candidate variables on the objective function. We propose an approach which is empowered by exploiting the information contained in a family of fathomed subproblems, collected beforehand from ...
full textMy Resources
Journal title
volume 4 issue 4 (FALL)
pages 341- 355
publication date 2014-03-21
By following a journal you will be notified via email when a new issue of this journal is published.
Hosted on Doprax cloud platform doprax.com
copyright © 2015-2023